Advanced Message Routing for Scalable Distributed Simulations

Advanced Message Routing for Scalable Distributed Simulations

The Joint Forces Command (JFCOM) Experimentation Directorate (J9)'s recent Joint Urban Operations (JUO) experiments have demonstrated the viability of Forces Modeling and Simulation in a distributed environment. The JSAF application suite, combined with the RTI-s communications system, provides the ability to run distributed simulations with sites located across the United States, from Norfolk,...

Scalable Message Routing for Mobile Software Assistants

In this paper we define an algorithm for location-independent communication of mobile software Personal Assistants (PAs). The algorithm extends the Query Server with Caching algorithm that we proposed earlier, with support of message routing in the wide-area networks. Our algorithm is suitable for two kinds of PAs collaboration: (1) within a local group of mobile individuals, who can communicat...

Routing Tables for Message Routing in Distributed Double Loop Networks

Distributed double loop networks are very advantageous for the design and implementation of local area networks and parallel processing architectures, mainly due to their fault-tolerance, low communication latency, and regularity. In this paper, an algorithm for the formulation of routing tables that facilitate routing of messages in a distributed double loop network is presented. The algorithm...

Distributed directory service and message routing for mobile agents

MOCgraph: Scalable Distributed Graph Processing Using Message Online Computing

Existing distributed graph processing frameworks, e.g., Pregel, Giraph, GPS and GraphLab, mainly exploit main memory to support flexible graph operations for efficiency. Due to the complexity of graph analytics, huge memory space is required especially for those graph analytics that spawn large intermediate results. Existing frameworks may terminate abnormally or degrade performance seriously w...